GATE CSE 1987
Q11.
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure?It converges always under all circumstances.
It converges always under all circumstances.It does not converge to a tool where the second differential coefficient changes sign.
It does not converge to a root where the second differential coefficient vanishes.
None of the above.
Q12.
The simplex method is so named becauseThe simple pendulum works on this method.
It is simple.
It is based on the theory of algebraic complexes.
No one thought of a better name.
Q13.
The data transfer rate of a double-density floppy disk system is about:500K bits/sec
5K bits/sec
50K bits/sec
5000K bits/sec
Q14.
Let P be a quicksort program to sort numbers in ascending order. Let t_{1} and t_{2} be the time taken by the program for the inputs \left[1 \ 2 \ 3 \ 4\right] and \left[5 \ 4 \ 3 \ 2 \ 1\right], respectively. Which of the following holds?t_{1} \gt t_{2}
t_{1} \lt t_{2}
t_{1} = t_{2}
t_{1}=t_{2}+5 \log 5
Q15.
The above circuit produces the output sequence:1111 0000 1111 000
1111 0001 0011 010
1111 1111 0000 0000
1010 1010 1010 1010
Q16.
The below figure shows four D-type flip-flops connected as a shift register using a XOR gate. The initial state and three subsequent states for three clock pulses are also given.\begin{array}{|c|c|c|c|c|} \hline \text{State} & Q_{A} & Q_{B} & Q_{C} & Q_{D} \\\hline \text{Initial} & 1 & 1 & 1 & 1 \\\hline \text{After the first clock} & 0 & 1 & 1 & 1 \\\hline \text{After the second clock} & 0 & 0 & 1 & 1 \\\hline \text{After the third clock} & 0 & 0 & 0 & 1 \\\hline \end{array}The state Q_{A} Q_{B} Q_{C} Q_{D} after the fourth clock pulse is0000
1111
1001
1000